潜艇运动对被动声纳浮标搜索的影响

由于被动声纳浮标隐蔽持续探测,潜艇可能由于机动进入浮标探测范围,从而增加了被探测概率。首先,在分析已有模型局限性的基础上,从潜艇运动对浮标搜索影响的原理出发,建立单枚浮标新增搜索区域模型,分析了单枚浮标搜索概率的影响因素,然后建模分析了潜艇运动对浮标拦截线搜索概率的影响因素,得出了影响作用仅对浮标作用距离、间距和航向敏感的结论,并对作战使用方法提出相关建议。     

基于飞蛾信息素寻偶机制的无人机集群协同搜索

为了提高无人机集群协同搜索移动目标的效率,提出一种基于飞蛾信息素寻偶机制的无人机集群协同搜索方法。根据飞蛾基于信息素选择飞行方向的寻偶行为,建立信息素图风向模型和飞蛾信息素寻偶模型。考虑无人机机间避撞约束,提出从飞蛾信息素寻偶机制到无人机集群分布式协同搜索的映射,并给出具体实现流程。仿真实验结果表明了所提方法在解决单个移动目标的协同搜索问题时的有效性和稳定性;外场飞行试验表明了所提方法在实际应用中的可行性。     

面向需求变化的军队自动化立体仓库货位优化

为提高军队自动化立体仓库的出库能力,提出应根据需求变化对在库物资货位进行动态调整,从而最大限度地保障军队物资需求。综合考虑堆垛机总行程、货物离散度和出库频率等评价指标,采用遗传算法对该多目标优化问题进行求解,并运用Matalab仿真。结果表明,该方法能较好地提高军队自动化立体仓库在需求动态变化时的出库能力。同时,该研究对一般仓库的货位优化也有一定的借鉴意义。     

弹药物资储备布局规划仿真模型＊

介绍了当前弹药物资储备布局规划的现状,对其涉及的要素进行分析,构建了弹药物资储备布局规划网络模型。在此基础上提出了分析模型,将弹药物资布局规划求解问题描述为有约束条件的多目标优化数学模型,解决了各仓库弹药存储量难以预测的问题,并通过实验进行了验证分析。     

空中进攻作战出动计划禁忌搜索优化分析方法

空中进攻作战出动计划涉及多种复杂因素,大规模空中进攻作战出动计划不仅计算量大、出动强度高、架次多,而且当战场形势发生变化时,必须及时对飞机出动计划做出调整,采用手工方式制定和修改作战计划已难以适应未来空中进攻作战的要求。从分析制定空中进攻作战航空兵出动计划所涉及的诸要素出发,提出了一个较为合理的作战出动计划模型,并采用禁忌搜索求解模型的优良解,为实现计算机制定和及时修正空中进攻作战出动计划提出了一种有效的解决方法。     

Many‐player rendezvous search: Stick together or split and meet?

Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

改进蚁群算法在P2P网络资源搜索中的应用

针对P2P网络搜索算法中冗余查询消息过多,资源搜索效率低的问题,提出了基于改进蚁群算法的P2P资源搜索算法,算法中在选择邻节点查询时,综合考虑到本地资源情况、邻节点资源情况、邻节点资源相似度等因素,尽量避开了资源搜索中的恶意节点,并改进了基本蚁群算法的状态转移规则,从而避免了查询消息的盲目发送。仿真实验表明,与传统资源搜索算法K-radom-walks和Flooding相比,该算法在搜索命中率和带宽利用率方面有明显提高。     

舰载机多机一体化机务保障调度研究

针对舰载机多机一体化机务保障调度问题,以出树、入树的形式描述实际保障过程中并行工序的约束关系,以最大保障完工时间和资源负载均衡性为目标,构建了舰载机多机一体化机务保障非线性多目标混合流水车间调度模型,并设计了一种结合基于Insert的动态邻域爬山搜索策略和并行工序的同步化修正的Memetic算法求解该模型。最后通过实例仿真验证了模型和所提算法的可行性和有效性。     

Exponential size neighborhoods for makespan minimization scheduling

We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011